Equations and fully residually free groups

نویسندگان

  • Olga Kharlampovich
  • Alexei Myasnikov
چکیده

Solving equations is one of the main themes in mathematics. A large part of the combinatorial group theory revolves around the word and conjugacy problems particular types of equations in groups. Whether a given equation has a solution in a given group is, as a rule, a non-trivial problem. A more general and more difficult problem is to decide which formulas of the first-order logic hold in a given group. Around 1945 A. Tarski put forward two problems on elementary theories of free groups that served as a motivation for much of the research in group theory and logic for the last sixty years. A joint effort of mathematicians of several generations culminated in the following theorems, solving these Tarski’s conjectures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 M ay 2 00 9 The fully residually F quotients of F ∗ 〈 x , y 〉

We describe the fully residually F groups; or limit groups relative to F ; that arise as the coordinate groups of irreducible systems of equations in two variables over a free group F that have coefficients in F. We use the structure theory of f.g. fully residually free groups and Bass-Serre theory. In particular we use foldings sequences for subgroups of fundamental groups of graphs of groups.

متن کامل

On the coordinate groups of irreducible systems of equations in two variables over free groups

We describe the fully residually F groups; or limit groups relative to F ; that arise from systems of equations in two variables over a free group F that have coefficients in F .

متن کامل

Effective JSJ Decompositions

In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process correspond to cyclic splittings of the coordinate group of the initial system of equations. This allows us to construct algorithmically Grushko’s decompositi...

متن کامل

Subgroup Properties of Fully Residually Free Groups

We prove that fully residually free groups have the Howson property, that is the intersection of any two finitely generated subgroups in such a group is again finitely generated. We also establish some commensurability properties for finitely generated fully residually free groups which are similar to those of free groups. Finally we prove that for a finitely generated fully residually free gro...

متن کامل

Fully Residually Free Groups and Graphs Labeled by Infinite Words

Let F = F (X) be a free group with basis X and Z[t] be a ring of polynomials with integer coefficients in t. In this paper we develop a theory of (Z[t], X)-graphs a powerful tool in studying finitely generated fully residually free (limit) groups. This theory is based on the Kharlampovich-Myasnikov characterization of finitely generated fully residually free groups as subgroups of the Lyndon’s ...

متن کامل

Finite Index Subgroups of Fully Residually Free Groups

Using graph-theoretic techniques for f.g. subgroups of F we provide a criterion for a f.g. subgroup of a f.g. fully residually free group to be of finite index. Moreover, we show that this criterion can be checked effectively. Also we obtain an analogue of Greenberg-Stallings Theorem for f.g. fully residually free groups, and prove that a f.g. non-abelian subgroup of a f.g. fully residually fre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009